Matroid Inequalities from Electrical Network Theory

نویسنده

  • David G. Wagner
چکیده

In 1981, Stanley applied the Aleksandrov–Fenchel Inequalities to prove a logarithmic concavity theorem for regular matroids. Using ideas from electrical network theory we prove a generalization of this for the wider class of matroids with the “half–plane property”. Then we explore a nest of inequalities for weighted basis– generating polynomials that are related to these ideas. As a first result from this investigation we find that every matroid of rank three or corank three satisfies a condition only slightly weaker than the conclusion of Stanley’s theorem. Dedicated with great admiration to Richard Stanley on the occasion of his 60th birthday.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Remarks on One Combinatorial Application of the Aleksandrov–fenchel Inequalities

In 1981, Stanley applied the Aleksandrov–Fenchel Inequalities to prove a logarithmic concavity theorem for regular matroids. Using ideas from electrical network theory we prove a generalization of this for the wider class of matroids with the “half–plane property”. Then we explore a nest of inequalities for weighted basis–generating polynomials that are related to these ideas. As a first result...

متن کامل

Applications of Matroid Theory and Combinatorial Optimization to Information and Coding Theory

The aim of this workshop was to bring together experts and students from pure and applied mathematics, computer science, and engineering, who are working on related problems in the areas of matroid theory, combinatorial optimization, coding theory, secret sharing, network coding, and information inequalities. The goal was to foster exchange of mathematical ideas and tools that can help tackle s...

متن کامل

Rank-Three Matroids are Rayleigh

A Rayleigh matroid is one which satisfies a set of inequalities analogous to the Rayleigh monotonicity property of linear resistive electrical networks. We show that every matroid of rank three satisfies these inequalities.

متن کامل

BIRS Workshop 09w5103 Applications of Matroid Theory and Combinatorial Optimization to Information and Coding Theory

(in alphabetic order by speaker surname) Speaker Alexander Barg (Dept. of ECE, Univ. of Maryland, College Park, USA) Title Linear Codes in the Ordered Hamming Space Abstract As is well known, the weight distribution of MDS codes in the Hamming metric can be recovered easily from the rank function of a uniform matroid. No such association has been established for the ordered Hamming space (the N...

متن کامل

The Vámos Network

The well-studied Vámos matroid has provided a wealth of interesting theoretical results in matroid theory. We use the Vámos matroid to construct a new network, which we call the Vámos network. We then exploit the Vámos network to answer in the negative the open question as to whether Shannon-type information inequalities are in general sufficient for computing network coding capacities. To acco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2005